Chatterbots and the Turing Test
نویسنده
چکیده
Senior Research Proposal 11-1-2000 Abstract Alan Turing’s landmark paper “Computing Machinery and Intelligence” proposed a famous test of machine intelligence: the ability to imitate human conversation. In the 50 years since the publication of Turing’s paper, the fields of Artificial Intelligence and Natural Language Processing have made great advances, and yet no program has ever successfully passed the Turing Test. This paper presents a description of the Turing Test and investigates the most successful chatterbots of the past, such as Eliza, Julia, and ALICE. Finally, this paper presents a proposal for a chatterbot system implementing successful chatterbot techniques and features not seen in existing systems.
منابع مشابه
CHATTERBOTS, TINYMUDS, and the Turing Test: Entering the Loebner Prize Competition
The Turing Test was proposed by Alan Turing in 1950; he called it the Imitation Game. In 1991 Hu Loebner prize competition, offering a f h Loebner started the 100,000 prize to the author of the first computer program to pass an unrestricted Turing test. Annual competitions are held each year with smaller prizes for the best program on a restricted Turing test. This paper describes the developme...
متن کاملTowards A More Natural and Intelligent Interface with Embodied Conversation Agent
Conversational agent also known as chatterbots are computer programs which are designed to converse like a human as much as their intelligent allows. In many ways, they are the embodiment of Turing's vision. The ability for computers to converse with human users using natural language would arguably increase their usefulness. Recent advances in Natural Language Processing (NLP) and Artificial I...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملImage flip CAPTCHA
The massive and automated access to Web resources through robots has made it essential for Web service providers to make some conclusion about whether the "user" is a human or a robot. A Human Interaction Proof (HIP) like Completely Automated Public Turing test to tell Computers and Humans Apart (CAPTCHA) offers a way to make such a distinction. CAPTCHA is a reverse Turing test used by Web serv...
متن کاملEvolutionary Sentence Combination for Chatterbots
Chatterbots are computer programs that simulate intelligent conversation. They make use of various techniques such as pattern matching, indexing, sentence reconstruction, and even natural language processing. In this paper we present an approach to chatterbots that mixes pattern matching with indexing and query matching methods inspired by information retrieval. We propose a model in which new ...
متن کامل